Professor Manne's paper recently appearing in this Journal (Manne, A. S. 1958. Programming of economic lot sizes. Management Sci. 4 (2, January).) is an ingenious application of linear programming technique to what may have hitherto been regarded as an intractable non linear situation. The excellences of the paper are, however, marred by a gap in the proof of the "Dominance" theorem. It is the aim of this communication to point out that, although the constructive proof offered by Manne is vulnerable to counter-example, an alternative, fairly simple, proof can be given. The theorem being true, the important results of the paper are not weakend.
In the standard portfolio problem, a shift in the distribution of the risky asset is 'portfolio-domi...
This article provides a simple proof of the Lorenz dominance criterion for two non-decreasing income...
A linear description for the economic lot-sizing problem consisting of exponentially many linear ine...
The notion of dominance most familiar to agricultural economists is perhaps the decision theoretic c...
Les problèmes d’ordonnancement sont des problèmes d’optimisation combinatoire modélisant la gestion ...
Abstract: On the unbounded knapsack problem, dominance relations play a crucial role to reduce items...
In the spirit of Fleurbaey et al. (2001), it is tempting to introduce more reasonable lower and uppe...
In this thesis we will analyse the two algorithms for linear programming (LP) presented by Stojkovic...
The mathematical concept of stochastic dominance was introduced to describe preference of one random...
Linear programming is one of the most successful disciplines within the eld of operations research. ...
Two common criticisms of Nash equilibrium are its dependence on very demanding epistemic assumptions...
We investigate differences between a simple Dominance Principle applied to sums of fair prices for v...
The pricing tests for optimality in a convex programming problem are not available when the producti...
We investigate differences between a simple Dominance Principle ap-plied to sums of fair prices for ...
Scheduling problems are combinatorial optimization problems arising in project management: the aim i...
In the standard portfolio problem, a shift in the distribution of the risky asset is 'portfolio-domi...
This article provides a simple proof of the Lorenz dominance criterion for two non-decreasing income...
A linear description for the economic lot-sizing problem consisting of exponentially many linear ine...
The notion of dominance most familiar to agricultural economists is perhaps the decision theoretic c...
Les problèmes d’ordonnancement sont des problèmes d’optimisation combinatoire modélisant la gestion ...
Abstract: On the unbounded knapsack problem, dominance relations play a crucial role to reduce items...
In the spirit of Fleurbaey et al. (2001), it is tempting to introduce more reasonable lower and uppe...
In this thesis we will analyse the two algorithms for linear programming (LP) presented by Stojkovic...
The mathematical concept of stochastic dominance was introduced to describe preference of one random...
Linear programming is one of the most successful disciplines within the eld of operations research. ...
Two common criticisms of Nash equilibrium are its dependence on very demanding epistemic assumptions...
We investigate differences between a simple Dominance Principle applied to sums of fair prices for v...
The pricing tests for optimality in a convex programming problem are not available when the producti...
We investigate differences between a simple Dominance Principle ap-plied to sums of fair prices for ...
Scheduling problems are combinatorial optimization problems arising in project management: the aim i...
In the standard portfolio problem, a shift in the distribution of the risky asset is 'portfolio-domi...
This article provides a simple proof of the Lorenz dominance criterion for two non-decreasing income...
A linear description for the economic lot-sizing problem consisting of exponentially many linear ine...